On extending slicing floorplans to handle L/T-shaped modules and abutment constraints

نویسندگان

  • F. Y. Young
  • Hannah H. Yang
چکیده

In oorplanning it is common that a designer wants to have certain modules abutting with one another in the nal pack ing Unfortunately few oorplanning algorithm can han dle abutment constraints although this feature is useful in practice The problem of controlling the relative positions of an arbitrary number of modules is non trivial Slicing oorplans have an advantageous feature that the topologi cal structure of the packing can be found without knowing the module dimensions This feature is good for handling placement constraints in general In this paper we make use of it to solve the abutment problem in the presence of L shaped and T shaped modules This is done by a proce dure which explores the topological structure of the packing and nd the neighborhood relationship between every pair of modules in linear time This enables us to check and x the abutment constraints and to handle the L shaped and T shaped modules There are many previous works on recti linear block packing but none of them can handle rectilinear blocks with soft modules e ciently Our main contribution is a method which can handle abutment constraints in the presence of L shaped or T shaped modules in such a way that the shape exibility of the soft modules can still be fully exploited to obtain a tight packing We tested our oorplanner with some benchmark data and the results are promising We can pack modules of which are L shaped or T shaped with twelve abutment constraints in about minutes giving less than deadspace using a MHz UltraSPARC workstation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On extending slicing floorplan to handle L/T-shaped modules andabutment constraints

In floorplanning, it is common that a designer wants to have certain modules abutting with one another in the final packing. The problem of controlling the relative positions of an arbitrary number of modules in floorplan design is nontrivial. Slicing floorplan has an advantageous feature in which the topological structure of the packing can be found without knowing the module dimensions. This ...

متن کامل

Slicing floorplans with boundary constraints

In floorplanning of very large scale integration design, it is useful if users are allowed to specify some placement constraints in the packing. One particular kind of placement constraints is to pack some modules on one of the four sides: on the left, on the right, at the bottom, or at the top of the final floorplan. These are called boundary constraints. In this paper, we enhanced a well-know...

متن کامل

A bijection between permutations and floorplans, and its applications

A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic ...

متن کامل

Slicing Floorplans with Boundary Constraint

In oorplanning of VLSI design it is useful if users are allowed to specify some placement constraints in the pack ing One particular kind of placement constraints is to pack some modules on one of the four sides on the left on the right at the bottom or at the top of the nal oorplan These are called boundary constraints In this paper we enhanced a well known slicing oorplanner to handle these b...

متن کامل

VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions

We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement and area optimization of soft modules in very large scale integration floorplan design. We have overcome the serious representational problems usually associated with encoding slicing floorplans into GAs, and have obtained excellent (often optimal) results for module sets with up to 100 rectangle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005